Sphere of Influence Graphs and the L-metric
نویسندگان
چکیده
We introduce sphere of in"uence graphs (SIGs) in the L∞-metric and study their elementary properties. We argue that SIGs de4ned with the L∞-metric are superior to Euclidean SIGs of Toussaint in capturing low-level perceptual information in certain dot patterns. Every graph without isolated vertices is a SIG in the L∞-metric for all su6ciently high dimensions, and this allows us to de4ne a graphical parameter, the SIG-dimension, that is akin to boxicity. We determine the SIG-dimensions for some classes of graphs and obtain inequalities for others. ? 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Local Symmetry of Unit Tangent Sphere Bundle With g- Natural Almost Contact B-Metric Structure
We consider the unit tangent sphere bundle of Riemannian manifold ( M, g ) with g-natural metric G̃ and we equip it to an almost contact B-metric structure. Considering this structure, we show that there is a direct correlation between the Riemannian curvature tensor of ( M, g ) and local symmetry property of G̃. More precisely, we prove that the flatness of metric g is necessary and sufficien...
متن کاملExtended graphs based on KM-fuzzy metric spaces
This paper, applies the concept of KM-fuzzy metric spaces and introduces a novel concept of KM-fuzzy metric graphs based on KM-fuzzy metric spaces. This study, investigates the finite KM-fuzzy metric spaces with respect to metrics and KM-fuzzy metrics and constructs KM-fuzzy metric spaces on any given non-empty sets. It tries to extend the concept of KM-fuzzy metric spaces to a larger ...
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کاملSolis Graphs and Uniquely Metric Basis Graphs
A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 127 شماره
صفحات -
تاریخ انتشار 2003